import java.util.Iterator;
import java.util.Stack;

public class T {

    public static void main(String[] args) {
        int[] a={2,1,0};
        int[] a1={1,2,0};

        System.out.println(Solution.IsPopOrder(a, a1));


    }
}




class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param pushV int整型一维数组
     * @param popV int整型一维数组
     * @return bool布尔型
     */
    public static boolean IsPopOrder (int[] pushV, int[] popV) {
        // write code here

        Stack<Integer> stack=new Stack<>();
        int j=0;
        for (int i = 0; i < popV.length; i++) {


                stack.push(pushV[i]);
            if(pushV[i]==popV[j]){


                while(!stack.empty()&&stack.peek()==popV[j]){
                    stack.pop();
                    j++;

                }


            }




        }
        if(stack.empty()){
            return true;

        }else {
            while(!stack.empty()){
                int n=stack.pop();

                if(n!=(popV[j])){
                    return false;
                }
                j++;
            }
        }
        return true;
    }
}